p t . 5 - 1 0 , 1 9 9 9 , p p . 2 1 2 3 - 2 1 2 6 . MACHINE LEARNING OF WORD PRONUNCIATION : THE CASE AGAINSTABSTRACTIONBertjan

Word pronunciation can be learned by inductive machine learning algorithms when it is represented as a classiication task: classify a letter within its local word context as mapping to its pronunciation. On the basis of generalization accuracy results from empirical studies, we argue that word pronunciation, particularly in complex spelling systems such as that of En-glish, should not be modelled in a way that abstracts from exceptions. Learning methods such as decision tree and backpropagation learning, while trying to abstract from noise, also throw away a large number of useful exceptional cases. Our empirical results suggest that a memory-based approach which stores all available word-pronunciation knowledge as cases in memory, and generalises from this lexicon via analogical reasoning , is at all times the optimal modelling method.